A Markov Service Policy with Application to the Queueing Study of a DQDB Station

نویسندگان

  • Ioannis Stavrakakis
  • Sophia Tsakiridou
چکیده

In this paper, a queueing system is formulated, analyzed and applied for the study of the queueing behavior of a DQDB station. At rst, an appropriate process is deened to capture the station's perception of the state of the distributed global queue (DQDB network) and a queueing model is formulated. In the sequel, a general queueing system is considered; the packet service time requirement is assumed to depend on the state of an underlying Markov chain at the time when the packet is forwarded to the head of the queue. Finally, the process which captures the state of the global distributed queue is approximated and the resulting queueing model for the DQDB station is related to the general queueing system and analyzed. Results for the queue occupancy distribution of the DQDB station are derived and compared with simulations. The Distributed Queue Dual Bus (DQDB) medium access protocol has been adopted as a Metropolitan Area Network (MAN) Standard (IEEE 802.6), 1]. It is a simple protocol which can achieve full utilization of the channel capacity. The DQDB MAN is a high speed (over 100 Mbps) integrated services network designed to accommodate traac generated by a variety of information sources, as well as provide for the interconnection of LANs. A detailed description of the Distributed Queue Dual Bus (DQDB) protocol may be found in 1]. A brief discussion on the protocol, as well as on various design and performance analysis issues, may be found in 2]-8] and the references cited there. No bandwidth balancing mechanism or priorities are investigated in the DQDB application considered in this paper, 1, 3, 7]. In this paper a single server queueing system is developed, analyzed and applied for the evaluation of the queueing behavior of a tagged DQDB station. Although the DQDB application has motivated the study of this queueing system, its generality allows for potentially wide applicability. Due to the distributed nature of the DQDB protocol, the service provided to a tagged station depends on the station's perception of the state of the global distributed queue which models the entire network. An appropriate process, which is capable of describing the station's perception of the state of the global queue at time instants of interest is identiied (balance process). The service discipline at the local queue of the tagged DQDB station is then described in terms of the balance process; the state of the process at …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Occupancy Distribution for a DQDB Station Based on a Queueing System with Markov-Structured Service Requirements

In this paper, the queue occupancy distribution of the DQDB station is derived through the formulation and exact analysis of a queueing model with the following characteristic: the packet service time requirement depends on the state of an underlying Markov-structured process at the time when the packet is forwarded to the server (head of the queue). Numerical results are presented and compared...

متن کامل

A Three-Priority Queueing Policy with Application to DQDB Modeling

In this paper, a discrete-time priority queueing policy is presented and analyzed. The 3-queue system provides distinct service strategies, namely the consistent-gated (c-G), 1-limited (L) and Head-of-Line (HoL), to each of the queues. The proposed service policy is potentially applicable to the modeling of network resource allocation policies in integrated services communication networks. In p...

متن کامل

Analysis of an M/G/1 Queue with Multiple Vacations, N-policy, Unreliable Service Station and Repair Facility Failures

This paper studies an M/G/1 repairable queueing system with multiple vacations and N-policy, in which the service station is subject to occasional random breakdowns. When the service station breaks down, it is repaired by a repair facility. Moreover, the repair facility may fail during the repair period of the service station. The failed repair facility resumes repair after completion of its re...

متن کامل

تعیین موعد مقرر تحویل پروژه در شبکه های پرت پویا با چندین خدمت دهنده

In this paper, multi-class dynamic PERT network is considered as a queueing network, where the projects are similar and new projects are generated according to a Poisson process. Each activity is performed independently in its corresponding service station with exponential distribution by one server from several servers settled in service station based on FCFS (Fist Come, First Served) discipli...

متن کامل

Machine Repair Queueing System with with Non-Reliable Service Stations And Heterogeneous Service Discipline (RESEARCH NOTE)

This investigation deals with M/M/R/N machine repair problem with R non-reliable service stations which are subjected to unpredictable breakdown. 1here is provision of an additional server to reduce backlog in the case of heavy load of failed machines. 1he permanent service stations repair the failed machines at an identical rate m and switch to faster repair rate when all service stations are ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Networks and ISDN Systems

دوره 26  شماره 

صفحات  -

تاریخ انتشار 1994